On a Question of Davenport and Lewis and New Character Sum Bounds in Finite Fields
نویسنده
چکیده
Let χ be a nontrivial multiplicative character of Fpn . We obtain the following results. (1). Let ε > 0 be given. If B = {Pnj=1 xjωj : xj ∈ [Nj + 1, Nj + Hj ] ∩ Z, j = 1, . . . , n} is a box satisfying n Π j=1 Hj > p ( 2 5, then for p > p(ε) we have, denoting χ a nontrivial multiplicative character | X x∈B χ(x)| ¿n p− ε 2 4 |B| unless n is even, χ is principal on a subfield F2 of size pn/2 and maxξ |B∩ξF2| > p−ε|B|. (2). Assume A, B ⊂ Fp such that |A| > p 9+ε, |B| > p 9+ε, |B + B| < K|B|. Then X x∈A,y∈B χ(x + y) < p−τ |A| |B|. (3). Let I ⊂ Fp be an interval with |I| = pβ and let D ⊂ Fp be a pβspaced set with |D| = pσ. Assume β > 1 4 − σ 4(1−σ) +δ. Then for a non-principal multiplicative character χ X x∈I,y∈D χ(x + y) < p− δ2 4 |I| |D|. We also improve a result of Karacuba. Typeset by AMS-TEX
منابع مشابه
Sum-Product and Character Sums in finite fields
In this talk I will present estimates on incomplete character sums in finite fields, with special emphasize on the non-prime case. Some of the results are of the same strength as Burgess celebrated theorem for prime fields. The improvements are mainly based on arguments from arithmetic combinatorics providing new bounds on multiplicative energy and an improved amplification strategy. In particu...
متن کاملOn a Question of Davenport and Lewis on Character Sums and Primitive Roots in Finite Fields
Let χ be a nontrivial multiplicative character of Fpn . We obtain the following results related to Davenport-Lewis’ paper [DL] and the Paley Graph conjecture. (1). Let ε > 0 be given. If
متن کاملOn Product Sets in Fields of Prime Order and an Application of Burgess’ Inequality
This is the origin of paper ‘On a Question of Davenport and Lewis on Character Sums and Primitive Roots in Finite Fields’. There is still a little to be typed. Abstract Let A ⊂ Fp with |A| > p and |A + A| < C0|A|. We give explicit constants k = k(C0, ε) and κ = κ(C0, ε) such that |Ak| > κp. The tools we use are Garaev’s sum-product estimate, Freiman’s Theorem and a variant of Burgess’ method. A...
متن کاملSome new bounds on the general sum--connectivity index
Let $G=(V,E)$ be a simple connectedgraph with $n$ vertices, $m$ edges and sequence of vertex degrees$d_1 ge d_2 ge cdots ge d_n>0$, $d_i=d(v_i)$, where $v_iin V$. With $isim j$ we denote adjacency ofvertices $v_i$ and $v_j$. The generalsum--connectivity index of graph is defined as $chi_{alpha}(G)=sum_{isim j}(d_i+d_j)^{alpha}$, where $alpha$ is an arbitrary real<b...
متن کاملSome bounds on unitary duals of classical groups - non-archimeden case
We first give bounds for domains where the unitarizabile subquotients can show up in the parabolically induced representations of classical $p$-adic groups. Roughly, they can show up only if the central character of the inducing irreducible cuspidal representation is dominated by the square root of the modular character of the minimal parabolic subgroup. For unitarizable subquotients...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007